[1] Luby M, Watson M, Gasiba T, et al. Mobile data broadcasting over MBMS tradeoffs in forward error correction[J]. ACM International Conference Proceeding Series, 2006, 193(10): 10-20. [2] Luby M, Watson M, Gasiba T, et al. Raptor codes for reliable download delivery in wireless broadcast systems//CCNC 2006. Las Vegas: , 2006: 192-197. [3] Tee R Y S, Nguyen T D, Yang Lieliang, et al. Serially concatenated Luby transform coding and bit-interleaved coded modulation using iteratlive decoding for the wireless Internet//VCT 2006-Spring. Melbourne: , 2006: 22-26. [4] Casari P, Rossi M, Zorzi M. Towards optimal broadcasting policies for HARQ based on fountain codes in underwater networks//WONS 2008. Garmisch Partenkirchen: , 2008: 11-19. [5] Luby M. LT codes//Proc of the 43th Annual IEEE Symposium on FOCS. Vancouver: , 2002: 271-280. [6] Shokrollahi A. Raptor codes[J]. IEEE Trans on Inform Theory, 2006, 52(6): 2551-2567. [7] Chang C C, Lee J S. Robust t-out-of-n oblivious transfer mechanism based on CRT[J]. Journal of Network and Computer Applications, 2009, 32(1): 226-235. [8] Chang C C, Lai Y P. A fast modular square computing method based on the generalized Chinese remainder theorem for prime moduli[J]. Applied Mathematics and Computation, 2005, 161(1): 181-194. [9] Zheng Xinliang, Huang C T, Matthews M. Chinese remainder theorem based group key management//Winston-Salem: , 2007: 266-271. [10] 黄诚, 易本顺. 基于抛物线映射的混沌LT编码算法[J]. 电子与信息学报, 2009, 31(10): 2527-2531. Huang Cheng, Yi Benshun. Chaotic LT encoding algorithm based on parabolic map. Journal of Electronics & Information Technology, 2009, 31(10): 2527-2531. [11] 蔡国权, 宋国文, 于大鹏. Logistic映射混沌扩频序列的性能分析[J]. 通信学报, 2000, 21(1): 60-63. Cai Guoquan, Song Guowen, Yu Dapeng. On properties of logistic-map chaotic spread spectrum sequences[J]. Journal of China Institute of Communications, 2000, 21(1): 60-63. [12] 黄诚, 易本顺. 喷泉码的Logistic映射实现[J]. 北京邮电大学学报, 2009, 32(1): 103-107. Huang Cheng, Yi Benshun. Implementation of fountain codes using logistic map. Journal of Beijing University of Posts and Telecommunications, 2009, 32(1): 103-107. |